Reportrapport Proving Run-time Properties of General Programs W.r.t Constructive Negation Proving Run-time Properties of General Programs W.r.t. Constructive Negation
نویسندگان
چکیده
In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation and arbitrary selection rule, and LD-CNF resolution, i.e. resolution with constructive negation and Prolog selection rule. We show that the class of programs which terminate for all ground goals for arbitrary (resp. Prolog) selection rule coincides with the so-called acyclic (resp. acceptable) programs, and that SLD-CNF (resp. LD-CNF) resolution is sound and complete w.r.t. Clark's semantics for bounded goals and acyclic (resp. acceptable) programs. These results are applied to the study of run-time properties of general programs: two proof methods are introduced and their soundness is proven respectively w.r.t. SLD-CNF and LD-CNF resolution.
منابع مشابه
A Methodology for Proving Termination of General Logic Programs
This paper introduces a methodology for proving termination of general logic programs, when the Prolog selection rule is considered. This methodology combines the approaches by Apt and Bezem [l] and Apt and Pedreschi [2], and provides a simple and flexible tool for proving termination. 1 Introduction General logic programs (glp's for short) provide formal-izations and implementations for specia...
متن کاملPractical Methods for Proving Termination of General Logic Programs
Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs w.r.t. the Pr...
متن کاملAnalysis of Normal Logic Programs
In this paper we present a dataaow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.
متن کاملA Methodology for Proving
Termination of logic programs with negated body atoms, here called general logic programs, is an important topic. This is also due to the fact that the computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs...
متن کاملConstructive Negation and Constraints
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, Constraint Lo...
متن کامل